The linearity of constructions and nested syntax
نویسندگان
چکیده
We use the notion of module over a monad to propose a new definition for abstract syntax and semantics (with binding constructions) encapsulating compositionality and various substitution lemmas.
منابع مشابه
Higher-order theories
We extend our approach to abstract syntax (with binding constructions) through modules and linearity. First we give a new general definition of arity, yielding the companion notion of signature. Then we obtain a modularity result as requested by [GU03]: in our setting, merging two extensions of syntax corresponds to building an amalgamated sum. Finally we define a natural notion of equation con...
متن کاملThe algebraicity of the lambda-calculus
We propose a new definition for abstract syntax (with binding constructions), and, accordingly, for initial semantics and algebraicity. Our definition is based on the notion of module over a monad and its companion notion of linearity. In our setting, we give a one-line definition of an untyped lambda-calculus. Among untyped lambda-calculi, the initial one, the pure untyped lambda-calculus, app...
متن کاملModules over Monads and Linearity
Inspired by the classical theory of modules over a monoid, we give a first account of the natural notion of module over a monad, which encompasses the notion of algebra. The associated notion of morphism of modules (”linear” natural transformations) captures important formal properties about substitution. In this paper, we present basic constructions of modules and we show examples concerning i...
متن کاملPerception Development of Complex Syntactic Construction in Children with Hearing Impairment
Objectives: Auditory perception or hearing ability is critical for children in acquisition of language and speech hence hearing loss has different effects on individuals’ linguistic perception, and also on their functions. It seems that deaf people suffer from language and speech impairments such as in perception of complex linguistic constructions. This research was aimed to study the pe...
متن کاملAlternation Elimination for Automata over Nested Words
This paper presents constructions for translating alternating automata into nondeterministic nested-word automata (NWAs). With these alternation-elimination constructions at hand, we straightforwardly obtain translations from various temporal logics over nested words from the literature like CaRet and μNWTL, and extensions thereof to NWAs, which correct, simplify, improve, and generalize the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006